Separable and low-rank continuous games
نویسندگان
چکیده
منابع مشابه
Low rank continuous-space graphical models
Constructing tractable dependent probability distributions over structured continuous random vectors is a central problem in statistics and machine learning. It has proven difficult to find general constructions for models in which efficient exact inference is possible, outside of the classical cases of models with restricted graph structure (chain, tree, etc.) and linear-Gaussian or discrete p...
متن کاملLow Rank Separable States Are A Set Of Measure Zero Within The Set of Low Rank States
It is well known that the set of separable pure states is measure 0 in the set of pure states. We extend this fact and show that the set of rank r separable states is measure 0 in the set of rank r states provided r is less than ∏p i=1 ni + p − ∑ ni. Recently quite a few authors have looked at low rank separable and entangled states. (See [1] and the references therein and [2] and [3] Therefore...
متن کاملOptimal Partitions in Additively Separable Hedonic Games
We conduct a computational analysis of partitions in additively separable hedonic games that satisfy standard criteria of fairness and optimality. We show that computing a partition with maximum egalitarian or utilitarian social welfare is NP-hard in the strong sense whereas a Pareto optimal partition can be computed in polynomial time when preferences are strict. Perhaps surprisingly, checking...
متن کاملVoluntarily Separable Repeated Games with Social Norms
We extend the voluntarily separable repeated Prisoner’s Dilemma (Fujiwara-Greve and Okuno-Fujiwara, 2009) to continuous actions. We show that there is a (constrained) efficient bimorphic equilibrium which is robust under evolutionary pressure. It consists of a cooperative strategy and a myopic defection strategy so that our model provides a foundation to incomplete information models as well.
متن کاملEfficient Preconditioning for Noisy Separable NMFs by Successive Projection Based Low-Rank Approximations
The successive projection algorithm (SPA) can quickly solve a nonnegative matrix factorization problem under a separability assumption. Even if noise is added to the problem, SPA is robust as long as the perturbations caused by the noise are small. In particular, robustness against noise should be high when handling the problems arising from real applications. The preconditioner proposed by Gil...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Game Theory
سال: 2008
ISSN: 0020-7276,1432-1270
DOI: 10.1007/s00182-008-0129-2